Session TE2 Sixth MDSP Workshop Maximum Likelihood Image Identification and Restoration Based on the EM Algorithm'

نویسنده

  • A. K. Katsaggelos
چکیده

In order to restore a degraded image, the first step is to identify the kind of degradation the image has suffered. Modeling the blurred image as the output of a two-dimensional (2D linear space-invariant (LSI) system, the identification problem is the estimation of the unknown point-spread function (PSF) of the LSI system. One approach to blur identification is to obtain the blur parameters (i.e. PSF) from the physics of the distortion process. However, it is hardly the actual case, since usually we do not have enough knowledge of how the images are distorted. INstead, the identification of the parameters needs to be based on the available observed images, which are noisy and blurred. The earliest work on blur identification concentrated on identifying PSFs that have zeros only on the unit bi-circle (motion blur, for example) [l]. The identification algorithm then was searching for these zeros in the frequency domain. Two of the shortcomings of this method are that PSFs which do not satisfy this requirement (truncated Gaussian PSF, for example) can not be identified and that the presence of noise makes the determination of the location of the zeros very difficult. In more recent work [2,3,4], the image and blur model identification problem is specified as a 2D autoregressive moving-average (ARMA) identification problem, where the AR coefficients are related to the image model, and the MA coefficients to the blur model (PSF). In [3] and [5] the blur identification was formulated as a constrained maximum likelihood (ML) problem. The resulting nonlinear minimization problem was solved by employing an iterative gradient based minimization procedure. This paper focuses on simultaneous iterative identification and restoration. It is conceptually advantageous to perform the identification and restoration simultaneously, since the interaction between the two processes may improve both the estimates for the blur and the image. Iterative techniques offer the possibility of incorporating prior knowledge about the original blur, model and image into the identification and restoration procedure. Furthermore, since they act upon one complete image, they are free from the causality restriction imposed by recursive techniques. More specifically, the image and noise are modeled as multivariate Gausian processes. Then we us ML estimation to estimate the parameters which characterize the Gaussian processes, whre the estimationof the conditional mean of the image represnets the restored image. Likelihood functions of observed images are highly nonlinear with respect to those parameters. Therefore, it is in general very difficult to directly maximize them. Here we exploit the expectation-Maximization (EM) algorithm [6] to find those parameters. The EM algorithm is a powerful itertive procedure for computing ML estimates of unknown parameters involved in the likelihood function of the observed data. In applying

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Image identification and restoration based on the expectation-maximization algorithm K. 1. Lay

CONTENTS 1. Introduction 2. Image and blur models 3. Maximum likelihood (ML) parameter identification 3.1. Formulation 3.2. Constraints on the unknown parameters 4. ML parameter identification via the expectation-maximization (EM) algorithm 4.1. The EM algorithm in the linear Gaussian case 4.2. Choices of complete data 4.2.1. {x,y} as the complete data 4.2.2. {x,v} as the complete data Abstract...

متن کامل

The Development of Maximum Likelihood Estimation Approaches for Adaptive Estimation of Free Speed and Critical Density in Vehicle Freeways

The performance of many traffic control strategies depends on how much the traffic flow models have been accurately calibrated. One of the most applicable traffic flow model in traffic control and management is LWR or METANET model. Practically, key parameters in LWR model, including free flow speed and critical density, are parameterized using flow and speed measurements gathered by inductive ...

متن کامل

Comparative assessment of the accuracy of maximum likelihood and correlated signal enhancement algorithm positioning methods in gamma camera with large square photomultiplier tubes

Introduction: The gamma cameras, based on scintillation crystal followed by an array of photomultiplier tubes (PMTs), play a crucial role in nuclear medicine. The use of square PMTs provides the minimum dead zones in the camera. The camera with square PMTs also reduces the number of PMTs relative to the detection area. Introduction of a positioning algorithm to improve the spat...

متن کامل

Dynamics of the maximum marginal likelihood hyper - parameter estimation in image restoration : gradient descent vs . EM algorithm

Dynamical properties of image restoration and hyper-parameter estimation are investigated by means of statistical mechanics. We introduce an exactly solvable model for image restoration and derive differential equations with respect to macroscopic quantities. From these equations, we evaluate relaxation processes of the system to the equilibrium state. Our statistical mechanical approach also e...

متن کامل

Relaxed ordered-subset algorithm for penalized-likelihood image restoration.

The expectation-maximization (EM) algorithm for maximum-likelihood image recovery is guaranteed to converge, but it converges slowly. Its ordered-subset version (OS-EM) is used widely in tomographic image reconstruction because of its order-of-magnitude acceleration compared with the EM algorithm, but it does not guarantee convergence. Recently the ordered-subset, separable-paraboloidal-surroga...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004